<html>
 <head>
  <link href="./leetcode-problem.css" rel="stylesheet" type="text/css">
 </head>
 <body>
  <div class="question_difficulty">
   难度：Easy
  </div>
  <div>
   <h1 class="question_title">
    118. Pascal's Triangle
   </h1>
   <p>
    Given a non-negative integer&nbsp;
    <em>
     numRows
    </em>
    , generate the first
    <em>
     numRows
    </em>
    of Pascal's triangle.
   </p>
   <p>
    <img alt="" src="https://upload.wikimedia.org/wikipedia/commons/0/0d/PascalTriangleAnimated2.gif" style="height:240px; width:260px">
    <br>
    <small>
     In Pascal's triangle, each number is the sum of the two numbers directly above it.
    </small>
   </p>
   <p>
    <strong>
     Example:
    </strong>
   </p>
   <pre>
<strong>Input:</strong> 5
<strong>Output:</strong>
[
     [1],
    [1,1],
   [1,2,1],
  [1,3,3,1],
 [1,4,6,4,1]
]
</pre>
  </div>
  <div>
   <h1 class="question_title">
    118. 杨辉三角
   </h1>
   <p>
    给定一个非负整数&nbsp;
    <em>
     numRows，
    </em>
    生成杨辉三角的前&nbsp;
    <em>
     numRows&nbsp;
    </em>
    行。
   </p>
   <p>
    <img alt="" src="https://upload.wikimedia.org/wikipedia/commons/0/0d/PascalTriangleAnimated2.gif">
   </p>
   <p>
    <small>
     在杨辉三角中，每个数是它左上方和右上方的数的和。
    </small>
   </p>
   <p>
    <strong>
     示例:
    </strong>
   </p>
   <pre><strong>输入:</strong> 5
<strong>输出:</strong>
[
     [1],
    [1,1],
   [1,2,1],
  [1,3,3,1],
 [1,4,6,4,1]
]</pre>
  </div>
 </body>
</html>